Ranking in Distributed Uncertain Database Environments
نویسندگان
چکیده
منابع مشابه
Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملDatabase Management Issues in Sensor-Enabled Distributed Environments
With the advances in embedded processors, low cost sensor technologies, and wireless communication (e.g., cellular and bluetooth technologies), smart devices that generate unprecedented amounts of diverse types of information about the real world and its activities will become an integral part of the ubiquitous computing fabric. Such devices will be capable of real-time capture, storage, proces...
متن کاملProduction Rules in Parallel and Distributed Database Environments
In most database systems with production rule facilities, rules respond to operations on centralized data and rule processing is performed in a centralized, sequential fashion. In parallel and distributed database environments, for maximum autonomy it is desirable for rule processing to occur separately at each site (or node), responding to operations on data at that site. However, since rules ...
متن کاملRobust Ranking of Uncertain Data
Numerous real-life applications are continually generating huge amounts of uncertain data (e.g., sensor or RFID readings). As a result, top-k queries that return only the k most promising probabilistic tuples become an important means to monitor and analyze such data. These “top” tuples should have both high scores in term of some ranking function, and high occurrence probability. The previous ...
متن کاملProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feature databases with uncertain data require special methods for effective similarity search. In this paper, we propose an effective and efficient probabilistic similarity ranking algorithm that exploits the full informat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering (IJECE)
سال: 2014
ISSN: 2088-8708
DOI: 10.11591/ijece.v4i4.5920